Constructing copositive matrices from interior matrices

نویسندگان

  • Charles R. Johnson
  • Robert Reams
  • CHARLES R. JOHNSON
  • ROBERT REAMS
چکیده

Let A be an n by n symmetric matrix with real entries. Using the l1-norm for vectors and letting S 1 = {x ∈ Rn|||x||1 = 1, x ≥ 0}, the matrix A is said to be interior if the quadratic form xT Ax achieves its minimum on S 1 in the interior. Necessary and sufficient conditions are provided for a matrix to be interior. A copositive matrix is referred to as being exceptional if it is not the sum of a positive semidefinite matrix and a nonnegative matrix. A method is provided for constructing exceptional copositive matrices by completing a partial copositive matrix that has certain specified overlapping copositive interior principal submatrices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela Constructing Copositive Matrices from Interior Matrices

Abstract. Let A be an n by n symmetric matrix with real entries. Using the l1-norm for vectors and letting S 1 = {x ∈ R|||x||1 = 1, x ≥ 0}, the matrix A is said to be interior if the quadratic form x Ax achieves its minimum on S 1 in the interior. Necessary and sufficient conditions are provided for a matrix to be interior. A copositive matrix is referred to as being exceptional if it is not th...

متن کامل

The Structure of Common Linear Copositive Lyapunov Functions for Continuous time Switched Positive Linear Systems

This paper addressed the structure of common linear copositive Lyapunov function (CLCLFs) for continuoustime switched positive linear systimes (CSPLS). In this note, first of all, for the n×n-dimensinal matrices family, which entries are the Hurwitz and Metzler switch matrices of an n-dimensional CSPLS, we presented, by a straightforward algebraic computation, a procedure for constructing a gro...

متن کامل

A Variational Approach to Copositive Matrices

This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational aspects related to the concept of copositivity. In addition, some new results on the geometry of the cone of copositive matrices are presented here for the first time.

متن کامل

Approximation of Copositive Programming via Linear Programming Using Second Order Sum of Square Decomposition

In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copos-itive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more accurately by a linear programming.

متن کامل

Irreducible elements of the copositive cone

An element A of the n× n copositive cone C is called irreducible with respect to the nonnegative cone N if it cannot be written as a nontrivial sum A = C + N of a copositive matrix C and an elementwise nonnegative matrix N . This property was studied by Baumert [2] who gave a characterisation of irreducible matrices. We demonstrate here that Baumert’s characterisation is incorrect and give a co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017